منابع مشابه
Working Paper Alfred P. Sloan School of Management Hierarchical Timestamping Algorithm Hierarchical Timestamping Algorithm Oct 2 1987 Received Hierarchical Timestamping Algorithm
The Hierarchical Timestamping Algorithm is proposed for handling database concurrency control. By analyzing transaction conflicts and partitioning the database into hierarchical partitions to which transactions will access discriminantly using different synchronization protocols, the algorithm can offer significant performance gain. It also reduces the need for transactions to leave traces (e.g...
متن کاملA Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
Several constructions have been proposed for implementing a Bounded Concurrent Timestamp System (BCTS). Some constructions are based on a recursively deened Precedence Graph. Such constructions have been viewed as hard to understand and to prove correct. Other constructions that are based on the Traceable Use abstraction rst proposed by Dwork and Waarts have been regarded as simple and have the...
متن کاملTimestamping After Commit
Many applications need transaction-consistent pictures of past states of the database. These applications use the commit t ime of the transaction i o timestamp the data. When a transaction is distributed, the cohorts must vote on a commit t ime and the coordinator must choose a commit t ime based on the votes of the cohorts. This implies that timestamps are applied after commit. Until the times...
متن کاملConcurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memory system, a powerful tool for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, `-exclusion, randomized consensus, and multi-writer multi-reader atomic registers. Solutions to these problems all use an \unbounded numbe...
متن کاملSome Timestamping Protocol Failures
Protocol failures are presented for two timestamping schemes. These failures emphasize the importance and di culty of implementing a secure protocol even though there exist secure underlying algorithms. As well, they indicate the importance of clearly de ning the goals for a protocol. For the scheme of Benaloh and de Mare (Eurocrypt '93), it is shown that although an indication of time can be i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 1989
ISSN: 0306-4379
DOI: 10.1016/0306-4379(89)90040-9